Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines

Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines

The -rst attempts concerning formalization of the notion of fuzzy algorithms in terms of Turing machines are dated in late 1960s when this notion was introduced by Zadeh. Recently, it has been observed that corresponding so-called classical fuzzy Turing machines can solve undecidable problems. In this paper we will give exact recursion-theoretical characterization of the computational power of ...

On the computing power of fuzzy Turing machines

We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively enumerable (r.e.) sets and universality. FTMs are first regarded as acceptors. It has recently been shown by J. Wiedermann that these machines have more computational power than classical Turing machines. Still, the c...

Classical Computability and Fuzzy Turing Machines

We work with fuzzy Turing machines (ftms) and we study the relationship between this computational model and classical recursion concepts such as computable functions, r.e. sets and universality. ftms are first regarded as acceptors. It has recently been shown in [23] that these machines have more computational power than classical Turing machines. Still, the context in which this formulation i...

Some improvements in fuzzy turing machines

In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

Super Turing-machines